Recurrence Relations for Knot Polynomials of Twist Knots

Linear Recurrence Relations for Graph Polynomials

A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gn be a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Ribò have proven linear recurrences with polynomial coe...

Asymptotics of Orthogonal Polynomials via Recurrence Relations

Motzkin Paths, Motzkin Polynomials and Recurrence Relations

We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polynomials)...

Recurrence Relations for Orthogonal Polynomials on Triangular Domains

Abstract: In Farouki et al, 2003, Legendre-weighted orthogonal polynomials Pn,r(u, v, w), r = 0, 1, . . . , n, n ≥ 0 on the triangular domain T = {(u, v, w) : u, v, w ≥ 0, u+ v+w = 1} are constructed, where u, v, w are the barycentric coordinates. Unfortunately, evaluating the explicit formulas requires many operations and is not very practical from an algorithmic point of view. Hence, there is...

Commensurability Classes of Twist Knots

In this paper we prove that if MK is the complement of a non-fibered twist knot K in S, then MK is not commensurable to a fibered knot complement in a Z/2Z-homology sphere. To prove this result we derive a recursive description of the character variety of twist knots and then prove that a commensurability criterion developed by D. Calegari and N. Dunfield is satisfied for these varieties. In ad...